Accelerating Multiple Compound Comparison Using LINGO-Based Load-Balancing Strategies on Multi-GPUs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accelerating Multiple Compound Comparison Using LINGO-Based Load-Balancing Strategies on Multi-GPUs

Compound comparison is an important task for the computational chemistry. By the comparison results, potential inhibitors can be found and then used for the pharmacy experiments. The time complexity of a pairwise compound comparison is O(n (2)), where n is the maximal length of compounds. In general, the length of compounds is tens to hundreds, and the computation time is small. However, more a...

متن کامل

Dynamic Load Balancing Strategies for Graph Applications on GPUs

Acceleration of graph applications on GPUs has found large interest due to the ubiquitous use of graph processing in various domains. The inherent irregularity in graph applications leads to several challenges for parallelization. A key challenge, which we address in this paper, is that of loadimbalance. If the work-assignment to threads uses node-based graph partitioning, it can result in skew...

متن کامل

Comparison of Load Balancing Strategies on Cluster-based Web Servers

This paper focuses on an experimental analysis of the performance and scalability of cluster-based web servers. We carry out the comparative studies using two experimental platforms, namely, a hardware testbed consisting of 16 PCs, and a trace-driven discrete-event simulator. Dispatcher and web server service times used in the simulator are determined by carrying out a set of experiments on the...

متن کامل

Comparison of Load Balancing Strategies on Cluster-based Web Servers

Sweden This paper focuses on an experimental analysis of the performance and scalability of cluster-based web servers. We carry out the comparative studies using two experimental platforms, namely, a hardware testbed consisting of sixteen PCs, and a trace-driven discrete-event simulator. Dispatcher and web server service times used in the simulator are determined by carrying out a set of experi...

متن کامل

Comparison of Dynamic Load Balancing Strategies

Wa90] A. Wagener: Lastverteilungsstrategien und Netzwerktopologien f ur eine Rea-lisierung der parallelen abstrakten Maschine PAM, Master thesis, RWTH Aa-chen, 1990, (in german) run times are not very fast (see table 4), but this is of minor importance. We are mainly interested in the speedups, which are possible using a certain load balancing strategy. Nevertheless, a modiied compiler which pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Genomics

سال: 2015

ISSN: 2314-436X,2314-4378

DOI: 10.1155/2015/950905